Time Costs in Actor Computations

نویسندگان

  • Michele Di Santo
  • Franco Frattolillo
چکیده

Actor programs give rise to computation structures that evolve dynamically and unpredictably both in shape and size. Therefore, their execution times cannot be statically determined. This paper describes an approach to the problem of estimating time costs of actor programs. The approach takes into account the constraints imposed both by the semantics and implementation of the model. In particular, implementation constraints can be captured and exploited to drastically reduce the number of computations generable by the program, thus simplifying the execution time evaluation. Moreover, execution times are expressed in a parametric form by using a variant of the LogP model able to synthetically characterize the target hardware/software platform.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Practical Dramaturgy for Actors through Theatrical Production Procedures

Dramaturgy, as a creative and critical act dependent on the theoretical and practical knowledge of theater, consists of two parts with Greek roots: Drama (action) and Ourgia (work and operation). Ourgia literally means to practice, act, and in other words process a raw material. Eugenio Barba divides Dramaturgy in to three parts: Actor Dramaturgy, Director Dramaturgy and Audience Dramaturgy. Th...

متن کامل

Supporting Relative Location Constraints in Actor Systems

The Actor model supports mobility of computations, and in actor migrations, absolute destinations must be explicitly specified. However, in many real world applications, relative location relationships are more meaningful. In this paper, we propose a middleware which supports relative location constraints of actors. We use a case study to illustrate that our middleware greatly enhances the flex...

متن کامل

Distributed Garbage Collection for Large-scale Mobile Actor Systems

Distributed actor garbage collection (GC) is a notoriously hard problem due to the nature of distributed actor systems — no common clock, no coherent global information, asynchronous and unordered message passing, autonomous behavior of actors, and counter-intuitive actor marking to identify live actors. Most existing distributed actor GC algorithms rely on First-In-First-Out (FIFO) communicati...

متن کامل

JMAS: A Java-Based Mobile Actor System for Distributed Parallel Computation

JMAS is a prototype network computing infrastructure based on mobile actors [10] using Java technology. JMAS requires a programming style di erent from commonly used approaches to distributed computing. JMAS allows a programmer to create mobile actors, initialize their behaviors, and send them messages using constructs provided by the JMAS Mobile Actor API. Applications are decomposed by the pr...

متن کامل

An Improved WAGNER-WHITIN Algorithm

We present an improved implementation of the Wagner-Whitin algorithm for economic lot-sizing problems based on the planning-horizon theorem and the Economic- Part-Period concept. The proposed method of this paper reduces the burden of the computations significantly in two different cases. We first assume there is no backlogging and inventory holding and set-up costs are fixed. The second model ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. UCS

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2005